The Non-Crossing Graph
نویسندگان
چکیده
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . . , n} with an edge between any two non-crossing sets. Various facts, some new and some already known, concerning the chromatic number, fractional chromatic number, independence number, clique number and clique cover number of this graph are presented. For the chromatic number of this graph we show: n(loge n − Θ(1)) ≤ χ(NCn) ≤ n(dlog2 ne − 1).
منابع مشابه
How to Eliminate Crossings by Adding Handles or Crosscaps
Let c k = cr k (G) denote the minimum number of edge crossings when a graph G is drawn on an orientable surface of genus k. The (orientable) crossing sequence c 0 ; c 1 ; c 2 ; : : : encodes the trade-oo between adding handles and decreasing crossings. We focus on sequences of the type c 0 > c 1 > c 2 = 0; equivalently, we study the planar and toroidal crossing number of doubly-toroidal graphs....
متن کاملiETA #1 Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs1
We consider the problem of computing non-crossing spanning trees in topological graphs. It is known that it is NP-hard to decide whether a topological graph has a noncrossing spanning tree, and that it is hard to approximate the minimum number of crossings in a spanning tree. We give improved fixed-parameter algorithms, where we use the number k of crossing edge pairs and the number μ of crossi...
متن کاملNon-Crossing Frameworks with Non-Crossing Reciprocals
We study non-crossing frameworks in the plane for which the classical reciprocal on the dual graph is also non-crossing. We give a complete description of the self-stresses on non-crossing frameworks G whose reciprocals are non-crossing, in terms of: the types of faces (only pseudo-triangles and pseudo-quadrangles are allowed); the sign patterns in the stress on G; and a geometric condition on ...
متن کاملThe projective plane crossing number of the circulant graph C(3k;{1, k})
The crossing number is an important measure of the non-planarity of a graph. Bhatt and Leighton [1] showed that the crossing number of a network (graph) is closely related to the minimum layout area required for the implementation of a VLSI circuit for that network. In general, determining the crossing number of a graph is hard. Garey and Johnson [3] showed that it is NP-complete. In fact, Hlin...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006